package minCostToMoveChips;

public class Solution {
    public int minCostToMoveChips(int[] position) {
        int ji=0;
        int ou=0;
        for (int i = 0; i < position.length; i++) {
            if(position[i]%2==0){
                ou++;
            }else{
                ji++;
            }
        }
        return Math.min(ou,ji);
    }
}//
